package main

import (
	"fmt"
)

func tta(arr []int) {
	arr[0] = 40
}

func init() {
	a := make([]int, 0)
	a = append(a, 20)
	a = append(a, 15)
	a = append(a, 16)
	tta(a)
	fmt.Println(a)
}

func main() {
	/*algorithm.QuickSortDemo()
	algorithm.BubbleSortDemo()
	algorithm.InsertSortDemo()
	algorithm.ShellSortDemo()
	algorithm.SelectionSortDemo()
	algorithm.HeapSortDemo()
	algorithm.MergeSortDemo()

	root := algorithm.CreateBinaryTree("根节点")
	oneLeft := root.SetLeftNode("一级左侧节点")
	oneRight := root.SetRightNode("一级右侧节点")
	oneLeft.SetLeftNode("二级1左侧节点")
	oneLeft.SetRightNode("二级1右侧节点")

	oneRight.SetLeftNode("二级2左侧节点")
	oneRight.SetRightNode("二级2右侧节点")
	by, _ := json.Marshal(root)

	fmt.Println(string(by))*/
}
